41![Effective and Efficient Data Reduction for the Subset Interconnection Design Problem? Jiehua Chen1 , Christian Komusiewicz1 , Rolf Niedermeier1 , Manuel Sorge1 , Ondˇrej Such´ y2 , and Mathias Weller3 1 Effective and Efficient Data Reduction for the Subset Interconnection Design Problem? Jiehua Chen1 , Christian Komusiewicz1 , Rolf Niedermeier1 , Manuel Sorge1 , Ondˇrej Such´ y2 , and Mathias Weller3 1](https://www.pdfsearch.io/img/d2c5f01a8eb0dfce928703faa12d3616.jpg) | Add to Reading ListSource URL: fpt.akt.tu-berlin.deLanguage: English - Date: 2013-10-09 05:34:13
|
---|
42![Constraint Design Rewriting Roberto Brunia , Alberto Lluch Lafuenteb , Ugo Montanaria a Dipartimento di Informatica, Universit`a di Pisa, Italy { bruni,ugo}@ di. unipi. it Constraint Design Rewriting Roberto Brunia , Alberto Lluch Lafuenteb , Ugo Montanaria a Dipartimento di Informatica, Universit`a di Pisa, Italy { bruni,ugo}@ di. unipi. it](https://www.pdfsearch.io/img/32e12414e246be6e7922c472cfeded92.jpg) | Add to Reading ListSource URL: dl.dropboxusercontent.comLanguage: English |
---|
43![Banshee: A Scalable Constraint-Based Analysis Toolkit? John Kodumal1 and Alex Aiken2 1 2 Banshee: A Scalable Constraint-Based Analysis Toolkit? John Kodumal1 and Alex Aiken2 1 2](https://www.pdfsearch.io/img/8a308261041542fb025b8348e28a5b57.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2005-06-06 18:55:41
|
---|
44![Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 10 Self-stabilizing Distributed Constraint Satisfaction ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 10 Self-stabilizing Distributed Constraint Satisfaction ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,](https://www.pdfsearch.io/img/db68ac608001b89aac4c5030ef77325e.jpg) | Add to Reading ListSource URL: cjtcs.cs.uchicago.eduLanguage: English - Date: 2000-02-21 01:31:44
|
---|
45![Incremental Analysis of Constraint Logic Programs MANUEL HERMENEGILDO and GERMAN PUEBLA Universidad Polit´ecnica de Madrid KIM MARRIOTT Monash University and Incremental Analysis of Constraint Logic Programs MANUEL HERMENEGILDO and GERMAN PUEBLA Universidad Polit´ecnica de Madrid KIM MARRIOTT Monash University and](https://www.pdfsearch.io/img/c3a345c55541ade5d4ed27fde2a51452.jpg) | Add to Reading ListSource URL: www.clip.dia.fi.upm.esLanguage: English - Date: 2005-07-26 16:20:28
|
---|
46![Journal of Artificial Intelligence Research931 Submitted 01/05; publishedEngineering Note Optiplan: Unifying IP-based and Graph-based Planning Journal of Artificial Intelligence Research931 Submitted 01/05; publishedEngineering Note Optiplan: Unifying IP-based and Graph-based Planning](https://www.pdfsearch.io/img/50a14d187632a29b0f6a6708d743a93d.jpg) | Add to Reading ListSource URL: www.menkes76.comLanguage: English - Date: 2012-10-29 18:17:44
|
---|
47![Query Answering Exploiting Structural Properties∗ Francesco Scarcello DEIS, Universita` della Calabria, Italy Query Answering Exploiting Structural Properties∗ Francesco Scarcello DEIS, Universita` della Calabria, Italy](https://www.pdfsearch.io/img/f96d58b43074984b73fbbfe46f7d6237.jpg) | Add to Reading ListSource URL: homepages.inf.ed.ac.ukLanguage: English - Date: 2006-07-04 06:02:52
|
---|
48![Filtering Algorithms for the NValue Constraint Christian Bessiere1 , Emmanuel Hebrard2 , Brahim Hnich3 , Zeynep Kiziltan4 , and Toby Walsh2 1 LIRMM, CNRS/University of Montpellier, France Filtering Algorithms for the NValue Constraint Christian Bessiere1 , Emmanuel Hebrard2 , Brahim Hnich3 , Zeynep Kiziltan4 , and Toby Walsh2 1 LIRMM, CNRS/University of Montpellier, France](https://www.pdfsearch.io/img/cc466aa02f837da0d99bc3b8fe1ecc79.jpg) | Add to Reading ListSource URL: homepages.laas.frLanguage: English - Date: 2010-11-22 06:22:31
|
---|
49![Architectures for Cooperating Constraint Solvers Alan Borning This material is based upon work supported in part by the National Science Foundation under Architectures for Cooperating Constraint Solvers Alan Borning This material is based upon work supported in part by the National Science Foundation under](https://www.pdfsearch.io/img/50e05c1040ff746d3273f5bf22477c19.jpg) | Add to Reading ListSource URL: www.vpri.orgLanguage: English - Date: 2015-01-21 19:14:21
|
---|
50![Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to](https://www.pdfsearch.io/img/ef40dd704d9b9fb7926e5f0dc52530dc.jpg) | Add to Reading ListSource URL: asz.informatik.hu-berlin.deLanguage: English - Date: 2008-06-05 10:03:31
|
---|